A Recurrent Solution of PH/M/c/N-Like and PH/M/c-Like Queues

We propose an efficient semi‐numerical approach to compute the steady‐state probability distribution for the number of requests at arbitrary and at arrival time instants in Ph/M/c‐like systems in which in the inter‐arrival time distribution is represented by an acyclic set of memoryless phases. Our method is based on conditional probabilities and results in a simple computationally stable recurrence. It avoids the explicit manipulation of potentially large matrices and involves no iteration. Due to the use of conditional probabilities, it delays the onset of numerical issues related to floating‐point underflow as the number of servers and/or phases increases. For generalized Coxian distributions, the computational complexity of the proposed approach grows linearly with the number of phases in the distribution.